The linear abstract machine

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Eecient Linear Abstract Machine with Single-pointer Property

We introduce xLIN, a novel linear abstract machine that introduces no penalty in computing with non-linear resources, while ensuring that computing with linear resources takes no space and constant time. Garbage collection is not required for linear objects, while still present for non-linear objects. We propose a weak calculus of explicit substitutions as its foundations, and show how it may b...

متن کامل

The Cryptographic Abstract Machine

The Cryptographic Abstract Machine is an executional model of cryptographic actions, independent of the concrete cryptographic procedures employed, even of the abstraction level of the underlying model of cryptography. This is motivated both by a theoretical purpose of relating the dynamics of protocol executions at different levels of abstraction, and by a practical purpose of enabling automat...

متن کامل

The Persistent Abstract Machine

The Persistent Abstract Machine is an integral part of a layered architecture model to support the Napier language. It interfaces cleanly with a persistent store, and allows persistence to be implemented without difficulty in a high-level language. The heap based storage mechanism of the Persistent Abstract Machine is designed to support the block retention nature of the Napier language. This a...

متن کامل

The York Abstract Machine

We introduce the York Abstract Machine (YAM) for implementing the graph programming language GP and, potentially, other graph transformation languages. The advantages of an abstract machine over a direct interpreter for graph transformation rules are better efficiency, use as a common target for compiling both future versions of GP and other languages, and portability of GP programs to differen...

متن کامل

The Euclid Abstract Machine

Concrete non-computable functions are usually related to the halting function. Is it possible to present examples of non-computability, which are unrelated to the halting problem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler constructions (a compass construction would suffice) which reveals the existence of non-computable functions not rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1988

ISSN: 0304-3975

DOI: 10.1016/0304-3975(88)90074-6